Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
نویسندگان
چکیده
منابع مشابه
Permissive nominal terms and their unification: an infinite, co-infinite approach to nominal techniques
Nominal terms extend first-order terms with binding. They lack some properties of firstand higher-order terms: Terms must be reasoned about in a context of ‘freshness assumptions’; it is not always possible to ‘choose a fresh variable symbol’ for a nominal term; it is not always possible to ‘α-convert a bound variable symbol’ or to ‘quotient by α-equivalence’; the notion of unifier is not based...
متن کاملPermissive nominal terms and their unification
We introduce permissive nominal terms. Nominal terms extend first-order terms with binding. They lack properties of firstand higher-order terms: Terms must be reasoned on in a context of ‘freshness assumptions’; it is not always possible to ‘choose a fresh variable symbol’ for a nominal term; and it is not always possible to ‘alpha-convert a bound variable symbol’. Permissive nominal terms reco...
متن کاملPermissive nominal terms and their unification Gilles
We introduce permissive nominal terms. Nominal terms are one way to extend first-order terms with binding. They lack some properties of firstand higher-order terms: Terms must be reasoned on in a context of ‘freshness assumptions’; it is not always possible to ‘choose a fresh variable symbol’ for a nominal term; and it is not always possible to ‘alpha-convert a bound variable symbol’. Permissiv...
متن کاملPermissive nominal terms
We present a simplified version of nominal terms with improved properties. Nominal terms are themselves a version of first-order terms, adapted to provide primitive support for names, binding, capturing substitution, and alpha-conversion. Nominal terms lack certain properties of first-order terms; it is always possible to ‘choose a fresh variable symbol’ for a first-order term and it is always ...
متن کاملAn Efficient Nominal Unification Algorithm
Nominal Unification is an extension of first-order unification where terms can contain binders and unification is performed modulo α-equivalence. Here we prove that the existence of nominal unifiers can be decided in quadratic time. First, we linearly-reduce nominal unification problems to a sequence of freshness and equalities between atoms, modulo a permutation, using ideas as Paterson and We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logic Journal of the IGPL
سال: 2010
ISSN: 1368-9894,1367-0751
DOI: 10.1093/jigpal/jzq006